An intersection theorem for supermatroids
نویسنده
چکیده
We generalize the matroid intersection theorem to distributive supermatroids, a structure that extends the matroid to the partially ordered ground set. Distributive supermatroids are special cases of both supermatroids and greedoids, and they generalize polymatroids. This is the first good characterization proved for the intersection problem of an independence system where the ground set is partially ordered. The characterization given has a more complex structure than the matroid (or polymatroid) intersection theorem. IPi 1990 Academic PESS, hc
منابع مشابه
Extension of Krull's intersection theorem for fuzzy module
In this article we introduce $mu$-filtered fuzzy module with a family of fuzzy submodules. It shows the relation between $mu$-filtered fuzzy modules and crisp filtered modules by level sets. We investigate fuzzy topology on the $mu$-filtered fuzzy module and apply that to introduce fuzzy completion. Finally we extend Krull's intersection theorem of fuzzy ideals by using concept $mu$-adic comp...
متن کاملON THE SYSTEM OF LEVEL-ELEMENTS INDUCED BY AN L-SUBSET
This paper focuses on the relationship between an $L$-subset and the system of level-elements induced by it, where the underlying lattice $L$ is a complete residuated lattice and the domain set of $L$-subset is an $L$-partially ordered set $(X,P)$. Firstly, we obtain the sufficient and necessary condition that an $L$-subset is represented by its system of level-elements. Then, a new representat...
متن کاملCompleteness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملMatroids on convex geometries (cg-matroids)
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid introduced by Dunstan, Ingleton, and Welsh in 1972. Distributive supermatroids or poset matroids are supermatroids defined on distributive lattices or sets of order ideals of posets. The class of cg-matroids includes distri...
متن کاملWeakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid
Distributive supermatroids generalize matroids to partially ordered sets. Completing earlier work of Barnabei, Nicoletti and Pezzoli we characterize the lattice of flats of a distributive supermatroid. For the prominent special case of a polymatroid the description of the flat lattice is particularly simple. Large portions of the proofs reduce to properties of weakly submodular rank functions. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 50 شماره
صفحات -
تاریخ انتشار 1990